In-queue priority purchase: a dynamic game approach

نویسندگان

چکیده

Abstract Pay-for-priority is a common practice in congestion-prone service systems. The extant literature on this topic restricts attention to the case where only epoch for customers purchase priority upon arrival , and if choose not upgrade when they arrive, cannot do so later during their wait. A natural alternative let pay at any time stay queue, even initially. This paper builds queueing-game-theoretic model that explicitly captures self-interested customers’ dynamic in-queue priority-purchasing behavior. When all (who have upgraded yet) simultaneously decide whether upgrade, we find our pure-strategy equilibria exist under some intuitive criteria, contrasting findings classical models can arrival. However, sequentially threshold-type may exist. In particular, sufficiently light traffic, number of ordinary accumulates certain threshold, then it always second last customer who upgrades, but general, could be from another position, queue-length threshold triggers an also vary with traffic intensity. Finally, subject sequential rule yields less revenue than upon-arrival systems small buffers.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Finite Capacity Priority Queue with Discouragement

In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...

متن کامل

A Finite Difference Equations Approach to a Priority Queue

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...

متن کامل

A new multi-mode and multi-product hub covering problem‎: ‎A priority M/M/c queue ‎approach

One main group of a transportation network is a discrete hub covering problem that seeks to minimize the total transportation cost. This paper presents a multi-product and multi-mode hub covering model, in which the transportation time depends on travelling mode between each pair of hubs. Indeed, the nature of products is considered different and hub capacity constraint is also applied. Due to ...

متن کامل

Dynamic Hw Priority Queue Based Schedulers for Embedded System

A real-time operating system (RTOs) is often used in embedded system, to structure the application code and to ensure that the deadlines are met by reacting on events by executing the functions within precise time. Most embedded systems are bound to real-time constraints with determinism and latency as a critical metrics. RTOs are generally implemented in software, increases computational overh...

متن کامل

Priority queue classes with priority update

A limitation in the design of the interface of C++ standard priority queues is addressed. The use of priority queues in Dijkstra’s shortest path search algorithm is used as an example. Priority queues are often implemented using heaps. There is a problem, as it may be necessary to change the priority of an element while it is in the queue, but finding the element from within a heap is costly. T...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Queueing Systems

سال: 2021

ISSN: ['1572-9443', '0257-0130']

DOI: https://doi.org/10.1007/s11134-021-09694-y